Search results for "Coherent extension"

showing 4 items of 4 documents

Conjunction and Disjunction Among Conditional Events

2017

We generalize, in the setting of coherence, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. Given a prevision assessment on the conjunction of two conditional events, we study the set of coherent extensions for the probabilities of the two conditional events. Then, we introduce by a progressive procedure the notions of conjunction and disjunction for n conditional events. Moreover, by defining the negation of conjunction and of disjunction, we show that De Morgan’s Laws still hold. We also show that the associative and commutative properties are satisfied. Finally, we examine in detail the conjunction for a family \(\mathcal F\) of t…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaComputer scienceConditional events · Conditional random quantities · Con- junction · Disjunction · Negation · Quasi conjunction · Coherent previ- sion assessments · Coherent extensions · De Morgan’s Laws02 engineering and technologyCoherence (philosophical gambling strategy)Settore MAT/01 - Logica Matematica01 natural sciencesDe Morgan's lawsConjunction (grammar)Set (abstract data type)010104 statistics & probabilitysymbols.namesakeNegation0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processing0101 mathematicsAlgorithmCommutative propertyAssociative propertyEvent (probability theory)
researchProduct

Generalized Logical Operations among Conditional Events

2018

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Frechet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaComputer Science - Artificial IntelligenceComputer scienceMonotonic functionProbabilistic reasoning02 engineering and technologyCommutative Algebra (math.AC)Conditional random quantitieFréchet-Hoeffding boundCoherent extensionNegationArtificial IntelligenceQuasi conjunction0202 electrical engineering electronic engineering information engineeringFOS: MathematicsCoherent prevision assessmentConditional eventNon-monotonic logicRule of inferenceCommutative propertyAssociative propertyDiscrete mathematicsProbability (math.PR)Probabilistic logicOrder (ring theory)ConjunctionMathematics - LogicCoherence (philosophical gambling strategy)p-entailmentProbabilistic inferenceMathematics - Commutative AlgebraConjunction (grammar)Artificial Intelligence (cs.AI)020201 artificial intelligence & image processingInference ruleNegationLogic (math.LO)Mathematics - ProbabilityDisjunction
researchProduct

Logical Operations among Conditional Events: theoretical aspects and applications

2019

We generalize the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. These notions are defined, in the setting of coherence, by means of suitable conditional random quantities with values in the interval $[0,1]$. We also define the notion of negation, by verifying De Morgan's Laws. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals and we show that some well known properties which are satisfied by conjunctions and disjunctions of unconditional events are also satisfied by conjunctions and disjunction of conditional events. We also examine in detail the coherence of the prevision a…

Settore MAT/06 - Probabilita' E Statistica MatematicaConditional events conditional random quantities conjunction disjunction negation coherent prevision assessments coherent extensions quasi conjunction probabilistic reasoning p-entailment inference rules iterated conditionals System P.
researchProduct

Algorithms for coherence checking and propagation of conditional probability bounds

2001

In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of va…

reduced sets of variables and constraintsSettore MAT/06 - Probabilita' E Statistica MatematicaUncertain knowledgeUncertain knowledge probabilistic reasoning under coherence imprecise conditional probability assessments g-coherence checking g-coherent extension algorithms computational aspects reduced sets of variables reduced sets of linear constraints.g-coherent extensionimprecise conditional probability assessmentsg-coherence checkingUncertain knowledge; probabilistic reasoning under coherence; imprecise conditional probability assessments; g-coherence checking; g-coherent extension; algorithms.; computational aspects; reduced sets of variables and constraints.algorithmsprobabilistic reasoning under coherencecomputational aspects
researchProduct